term rewriting system造句

• 8 feng s , cao s , liu s . mechanizing weak termination proving of term rewriting systems by induction . in proc
  本方法是对基于结构归纳法和项重写的弱终止性形式自动证明方法的扩展。
• Theoretical computer science , 1997 , 175 : 127 - 158 . 3 toyama y . how to prove equivalence of term rewriting systems without induction
  本方法基于覆盖集合归纳法和项重写系统的元计算模型：动态项重写计算。
• 11 feng s . equivalence proving of term rewriting systems by induction . computer science , 2000 , 27 : 5 - 7 . in chinese 12 gramlich b . abstract relations between restricted termination and confluence properties of rewrite systems
  本方法既可以通过在证明中使用命题来实现“向前证明” ，也可以通过在证明的过程中发现引理来实现“向后证明” 。
• Weakly terminating property in a restricted domain of a term rewriting system , one with structural induction , one with cover - set induction , and the third without induction , and describes their mechanization based on a meta - computation model for term rewriting systems - dynamic term rewriting calculus
  基于覆盖集合归纳法的项重写系统弱基终止性证明的机械化论文提出一种关于一般化了的项重写系统弱基终止性，即，在特定领域的项重写系统弱终止性的形式自动证明方法。